Strategy intervention for the evolution of fairness
نویسندگان
چکیده
Masses of experiments have shown individual preference for fairness which seems irrational. The reason behind it remains a focus for research. The effect of spite (individuals are only concerned with their own relative standing) on the evolution of fairness has attracted increasing attention from experiments, but only has been implicitly studied in one evolutionary model. The model did not involve high-offer rejections, which have been found in the form of non-monotonic rejections (rejecting offers that are too high or too low) in experiments. Here, we introduce a high offer and a non-monotonic rejection in structured populations of finite size, and use strategy intervention to explicitly study how spite influences the evolution of fairness: five strategies are in sequence added into the competition of a fair strategy and a selfish strategy. We find that spite promotes fairness, altruism inhibits fairness, and the non-monotonic rejection can cause fairness to overcome selfishness, which cannot happen without high-offer rejections. Particularly for the group-structured population with seven discrete strategies, we analytically study the effect of population size, mutation, and migration on fairness, selfishness, altruism, and spite. A larger population size cannot change the dominance of fairness, but it promotes altruism and inhibits selfishness and spite. Intermediate mutation maximizes selfishness and fairness, and minimizes spite; intermediate mutation maximizes altruism for intermediate migration and minimizes altruism otherwise. The existence of migration inhibits selfishness and fairness, and promotes altruism; sufficient migration promotes spite. Our study may provide important insights into the evolutionary origin of fairness.
منابع مشابه
Task Scheduling Algorithm Using Covariance Matrix Adaptation Evolution Strategy (CMA-ES) in Cloud Computing
The cloud computing is considered as a computational model which provides the uses requests with resources upon any demand and needs.The need for planning the scheduling of the user's jobs has emerged as an important challenge in the field of cloud computing. It is mainly due to several reasons, including ever-increasing advancements of information technology and an increase of applications and...
متن کاملModified Pareto archived evolution strategy for the multi-skill project scheduling problem with generalized precedence relations
In this research, we study the multi-skill resource-constrained project scheduling problem, where there are generalized precedence relations between project activities. Workforces are able to perform one or several skills, and their efficiency improves by repeating their skills. For this problem, a mathematical formulation has been proposed that aims to optimize project completion time, reworki...
متن کاملA Differential Evolution and Spatial Distribution based Local Search for Training Fuzzy Wavelet Neural Network
Abstract Many parameter-tuning algorithms have been proposed for training Fuzzy Wavelet Neural Networks (FWNNs). Absence of appropriate structure, convergence to local optima and low speed in learning algorithms are deficiencies of FWNNs in previous studies. In this paper, a Memetic Algorithm (MA) is introduced to train FWNN for addressing aforementioned learning lacks. Differential Evolution...
متن کاملEvolutions of Crime Prevention Strategy in Democratic Model of Criminal Policy
In the light of Discontinuing Strategy, new crime prevention approaches has directed by the democratic model of criminal policy to limit the requirements of security – oriented paradigm. The fact that has preferred situational crime prevention on social crime prevention referring to the confrontation of democratic countries with terrorist crimes, crime rhizomatic, domination of new powers and b...
متن کاملTHE CMA EVOLUTION STRATEGY BASED SIZE OPTIMIZATION OF TRUSS STRUCTURES
Evolution Strategies (ES) are a class of Evolutionary Algorithms based on Gaussian mutation and deterministic selection. Gaussian mutation captures pair-wise dependencies between the variables through a covariance matrix. Covariance Matrix Adaptation (CMA) is a method to update this covariance matrix. In this paper, the CMA-ES, which has found many applications in solving continuous optimizatio...
متن کامل